Paths forward in radioglaciology

Building Certifications Paths: Forward vs. Reverse

In general, building and validating a certification path connecting a trust anchor to a target can be a very timeconsuming process. As such, any optimizations are valuable. Certification paths are commonly built from the target to the trust anchor (“building in the forward direction”) or from the trust anchor to the target (“building in the reverse direction”). This paper presents a comparison ...

Edmonds' Branching Theorem in Digraphs Without Forward-Infinite Paths

Let D be a finite digraph, and let V0, . . . , Vk−1 be nonempty subsets of V (D). The (strong form of) Edmonds’ branching theorem states that there are pairwise edge-disjoint spanning branchings B0, . . . ,Bk−1 in D such that the root set of Bi is Vi (i = 0, . . . , k − 1) if and only if for all ∅ 6= X ⊆ V (D) the number of ingoing edges of X is greater than or equal to the number of sets Vi di...

Flexible Business Process Management Using Forward Stepping and Alternative Paths

The abilty to continuously revise business practices is essential to organizations aiming at reducing their costs and increasing their revenues. Rapid and continuous changes to business processes result in less control over the executed activities. As a result, the ability of process designers to produce solid, well-validated work‡ow models is limited. Work‡ow management systems (WfMSs), servin...

Integrity without extinction: paths forward for gambling research.

Single-Point Visibility Constraint Minimum Link Paths in Simple Polygons

We address the following problem: Given a simple polygon $P$ with $n$ vertices and two points $s$ and $t$ inside it, find a minimum link path between them such that a given target point $q$ is visible from at least one point on the path. The method is based on partitioning a portion of $P$ into a number of faces of equal link distance from a source point. This partitioning is essentially a shor...